public class Solution {
    public boolean increasingTriplet(int[] nums) {
        int n = nums.length;
        if (n < 3){
            return false;
        }
        //右边最小的
        int[] leftMin = new int[n];
        leftMin[0] = nums[0];
        //
        for (int i = 1; i < n; i++){
            leftMin[i] = Math.min(leftMin[i - 1], nums[i]);
        }
        int[] rightMax = new int[n];
        rightMax[n - 1] = nums[n - 1];
        for (int i = n - 2; i >= 0; i--){
            rightMax[i] = Math.max(rightMax[i + 1], nums[i]);
        }
        for (int i = 1; i < n-1; i++){
            if (nums[i] > leftMin[i-1] && nums[i] < rightMax[i+1]){
                return true;
            }
        }
        return false;
    }
}
